Securing Proof-of-Stake Blockchain Protocols

نویسندگان

  • Wenting Li
  • Sébastien Andreina
  • Jens-Matthias Bohli
  • Ghassan Karame
چکیده

Proof-of-Stake (PoS) protocols have been actively researched for the past five years. PoS finds direct applicability in open blockchain platforms and has been seen as a strong candidate to replace the largely inefficient Proof of Work mechanism that is currently plugged in most existing open blockchains. Although a number of PoS variants have been proposed, these protocols suffer from a number of security shortcomings; for instance, most existing PoS variants suffer from the nothing at stake and the long range attacks which considerably degrade security in the blockchain. In this paper, we address these problems and we propose two PoS protocols that allow validators to generate at most one block at any given “height”—-thus alleviating the problem of nothing at stake and preventing attackers from compromising accounts to mount long range attacks. Our first protocol leverages a dedicated digital signature scheme that reveals the identity of the validator if the validator attempts to work on multiple blocks at the same height. On the other hand, our second protocol leverages existing pervasive Trusted Execution Environments (TEEs) to limit the block generation requests by any given validator to a maximum of one at a given height. We analyze the security of our proposals and evaluate their performance by means of implementation; our evaluation results show that our proposals introduce tolerable overhead in the block generation and validation process when compared to existing PoS protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Scalable Proof-of-Stake Blockchain in the Open Seing

Bitcoin and blockchain technologies have proven to be a phenomenal success. Œe un-derlying techniques hold huge promise to change the future of €nancial transactions, andeventually the way people and companies compute, collaborate, and interact. At the sametime, the current Bitcoin-like proof-of-work based blockchain systems are facing many chal-lenges. For example, a huge amoun...

متن کامل

2-hop Blockchain: Combining Proof-of-Work and Proof-of-Stake Securely∗

Cryptocurrencies like Bitcoin have proven to be a phenomenal success. Bitcoin-like systems use proofof-work mechanism which is therefore considered as 1-hop blockchain, and their security holds if the majority of the computing power is under the control of honest players. However, this assumption has been seriously challenged recently and Bitcoin-like systems will fail when this assumption is b...

متن کامل

A Provably Secure Proof-of-Stake Blockchain Protocol

We present a provably-secure blockchain protocol based on “proof of stake.” As far as we are aware, this is the first proof of stake blockchain protocol which provides rigorous security guarantees. The security properties of the system are analyzed in the model of [9] and are comparable to the ones possessed by the bitcoin blockchain protocol which utilizes proof of work. Furthermore, an incent...

متن کامل

TwinsCoin: A Cryptocurrency via Proof-of-Work and Proof-of-Stake

We design and implement TwinsCoin, the €rst cryptocurrency based on a provably secure and scalable public blockchain design using both proof-of-work and proof-of-stake mechanisms. Di‚erent from the proof-ofwork based Bitcoin, our construction uses two types of resources, computing power and coins (i.e., stake). Œe blockchain in our system is more robust than that in a pure proof-of-work based s...

متن کامل

Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol

We present “Ouroboros Praos”, a new proof-of-stake blockchain protocol that provides, for the first time, a robust distributed ledger that is provably secure in the semi-synchronous adversarial setting, i.e., assuming a delay ∆ in message delivery which is unknown to protocol participants, and fully adaptively secure, i.e., the adversary can choose to corrupt any participant of an ever evolving...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017